Analysis of Statistics for Generalized Stirling Permutations
نویسندگان
چکیده
In this work we give a study of generalizations of Stirling permutations, a restricted class of permutations of multisets introduced by Gessel and Stanley [15]. First we give several bijections between such generalized Stirling permutations and various families of increasing trees extending the known correspondences of [20, 21]. Then we consider several permutation statistics of interest for generalized Stirling permutations as the number of left-to-right minima, the number of left-to-right maxima, the number of blocks of specified sizes, the distance between occurrences of elements, and the number of inversions. For all these quantities we give a distributional study, where the established connections to increasing trees turn out be very useful. To obtain the exact and limiting distribution results we use several techniques ranging from generating functions, connections to urn models, martingales and Stein’s method.
منابع مشابه
Stable multivariate Eulerian polynomials and generalized Stirling permutations
We study Eulerian polynomials as the generating polynomials of the descent statistic over Stirling permutations – a class of restricted multiset permutations. We develop their multivariate refinements by indexing variables by the values at the descent tops, rather than the position where they appear. We prove that the obtained multivariate polynomials are stable, in the sense that they do not v...
متن کاملRook Theory, Generalized Stirling Numbers and (p, q)-Analogues
In this paper, we define two natural (p, q)-analogues of the generalized Stirling numbers of the first and second kind S(α, β, r) and S(α, β, r) as introduced by Hsu and Shiue [17]. We show that in the case where β = 0 and α and r are nonnegative integers both of our (p, q)-analogues have natural interpretations in terms of rook theory and derive a number of generating functions for them. We al...
متن کاملGeneralized Stirling Permutations and Forests: Higher-Order Eulerian and Ward Numbers
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural three-parameter generalization of the well-known Eulerian numbers. We give the generating function for this new class of numbers and, in the simplest cases, we...
متن کاملGeneralized Stirling permutations, families of increasing trees and urn models
Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the connection between Stirling permutations and plane recursive trees and proved a joint normal law for the parameters considered by Bona. Here we will consider generalized Stirling permutations extending the earlier resu...
متن کاملPlane Recursive Trees, Stirling Permutations and an Urn Model
We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also prove results on the joint distribution of the numbers of ascents, descents and plateaux in a random Stirling permutation. The proof uses an interesting gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 20 شماره
صفحات -
تاریخ انتشار 2011